P2P ARCHITECTURE AND BITTORRENT

Tags: #◇Computer Science #◇NSCOM01 #◇Conceptual #◇P2P #◇BitTorrent

---

◇Overview

Unlike traditional client-server architectures that rely on always-on central servers, Peer-to-Peer (P2P) architectures distribute the workload among the end systems (peers). This paradigm provides incredible self-scalability because every new peer joining the network adds not only demand but also service capacity (upload bandwidth). BitTorrent is a prominent protocol that leverages P2P for efficient, large-scale file distribution.

◇Key Definitions

• Peer-to-Peer (P2P): A decentralized network architecture where end systems communicate directly without passing through a central server.
• Torrent: A group of peers participating in the exchange of chunks of a specific file.
• Tracker: A centralized server in BitTorrent that keeps track of the peers currently active in a torrent.
• Tit-for-Tat: A BitTorrent algorithm where a peer uploads only to the peers that are uploading to them at the highest rates.

◇Theoretical Framework / Core Concepts

Distribution Time Comparison

The primary advantage of P2P is distribution time scaling. Let $F$ be the file size, $N$ the number of peers, $u_s$ the server upload speed, $u_i$ the upload speed of peer $i$, and $d_{min}$ the minimum download speed among peers.

Client-Server Distribution:
The server must sequentially upload a full copy of the file to every client. The distribution time grows linearly with the number of clients:
$D_{c-s} \ge \max\left\{ \frac{N \cdot F}{u_s}, \frac{F}{d_{min}} \right\}$

P2P Distribution:
In P2P, clients help the server distribute the file. As $N$ increases, the total available upload capacity $(u_s + \sum u_i)$ increases, drastically reducing the distribution time:
$D_{P2P} \ge \max\left\{ \frac{F}{u_s}, \frac{F}{d_{min}}, \frac{N \cdot F}{u_s + \sum u_i} \right\}$

BitTorrent Operation

1. Chunking: Files are divided into smaller, fixed-size chunks (typically 256 Kb).
2. Joining a Torrent: A peer contacts the Tracker to get a list of active peers in the torrent, then forms direct TCP connections with a subset of them (neighbors).
3. Rarest First Strategy: To ensure all chunks remain available even if the original seeder leaves, peers ask neighbors for their chunk lists and specifically request the chunks that are the rarest (least available) in the local network first.
4. Incentive Mechanism (Tit-for-Tat):
   • A peer continuously evaluates the download rates from its neighbors (every 10 seconds).
   • It sends (unchokes) chunks only to the top 4 peers that are currently providing data to it at the highest rate.
5. Optimistic Unchoking:
   • Every 30 seconds, a peer randomly selects one additional neighbor to send chunks to, regardless of their download rate.
   • This probes the network for potentially better trading partners and allows new peers (who have nothing to trade yet) to get their first chunks.

◇Summary & Key Takeaways

• P2P architecture is inherently self-scaling; new peers bring additional upload capacity.
• Compared to Client-Server, P2P significantly reduces the time required to distribute large files to many users.
• BitTorrent maximizes efficiency and file longevity using the Rarest First strategy.
• BitTorrent enforces cooperation and prevents "leeching" via the Tit-for-Tat incentive mechanism, while allowing new peers to join via Optimistic Unchoking.

◇References & Navigation

• Previous Topic: ◇Session Initiation Protocol
• Next Topic: ◇Skype and P2P Voice Architecture
• Related Notes: ◇Applications